Turing Automata and Graph Machines

Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by generalizing the classical Turing machine concept, so that the collection of such machines becomes an indexed monoidal algebra. On the analogy of the von Neumann data-flow computer architecture, Turing graph machines are proposed as potentially reversible low-level universal computational devices, and a truly reversible molecular size hardware model is presented as an example

Characteristics of the Dual Model among the OECD Countries - an FOI Model Analysis

Deciding on the development path of the economy has been a delicate question in economic policy, not least because of the trade-off effects which immediately worsen certain economic indicators as steps are taken to improve on others. The paper offers help to decide on such policy dilemmas, based on an analysis conducted among OECD countries with the FOI model (focusing on the future, outside and inside potentials). Several development models can be deduced with this method, from which only the dual model is discussed in detail. The dual model implies a development strategy focused on the attraction of outside resources, the instruments of which are also presented. The findings presented in the paper are part of a large OTKA (Hungarian Scientific Research Fund) study, which develops step by the step the methodology of the FOI model and discusses all of the development models found among OECD countries